Proving hypersafety compositionally

Hypersafety properties of arity n are program that relate traces a (or, more generally, programs). Classic examples include determinism, idempotence, and associativity. A number relational logics have been introduced to target this class properties. Their aim is construct simpler proofs by capitalizing on structural similarities between the related programs. We propose an unexplored, complementary proof principle establishes hyper-triples (i.e. hypersafety judgments) as unifying compositional building block for proofs, we use it develop Logic Hyper-triple Composition (LHC), which supports forms compositionality were not achievable in previous logics. prove LHC sound apply challenging examples.